Robust Path Construction for Reliable Data Transmissions in Node Disjoint Multipath Routing
نویسندگان
چکیده
منابع مشابه
A Reliable Node-disjoint Multipath Routing Protocol for Manet
INTRODUCTION: A mobile ad-hoc network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. Ad hoc is Latin and means "for this purpose".Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. ...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملA Robust Zone Disjoint Multipath Routing Protocol
A new multipath routing protocol which is disjoint at the zone level is proposed. The proposed routing protocol is based on the hybrid Zone based Hierarchical Link State Routing Protocol (ZHLS). The proposed work establishes multiple zone disjoint paths between the source and the destination zones. The establishment of multiple paths between the source and the destination zones helps in increas...
متن کاملAn Analysis of Link Disjoint and Node Disjoint Multipath Routing for Mobile Ad Hoc Network
In Mobile Ad hoc Network, path between source and destination node changes too frequently due to unpredictable behavior and movement of mobile nodes. The data delivery to the intended destination becomes very challenging. The paths exist between source and destination node may be various types. Data delivery may be done with single or multiple paths. Single path sometimes not guaranteed about d...
متن کاملFault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes
Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2015
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v13i3.1496